Stereo Matching Based on Grouping of Intensity Segments

نویسنده

  • ZengFu Wang
چکیده

In this paper, we propose a grouping based method to solve the stereo matching problem. We employ intensity segments on scan lines of stereo images as primitives for matching, and formulate the problem by introducing a multi-stage grouping process of the intensity segments. A relation that should be satisfied between a matching pair of intensity segments and Some constraints, including the self-occlusion constraint, the uniqueness constraint, the disparity constraint, the minimum risk criterion and the length ratio criterion, are established. A multi-stage grouping process is involved to make final decision.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stereo Matching as a Multistage Grouping Process

In this paper, we propose a grouping-based method to solve the stereo matching problem. We employ intensity segments on scan lines of stereo images as primitives for matching, and formulate the problem by introducing a multistage grouping process of the intensity segments. A relation between a matching pair of intensity segments and some constraints are established.

متن کامل

3-D Reconstruction Based on Projective Invariants

We present a new projective invariant-based technique for recovering depth information from stereo images. The basic idea of our method is to use intensity segments as primitives for stereo matching. To recover the depth information of intensity segments, two projective invariants are introduced. From the two invariants, we can derive a relation that should be satisfied between the matching pai...

متن کامل

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

Cooperative Stereo Matching with Color-Based Adaptive Local Support

Color processing imposes a new constraint on stereo vision algorithms: The assumption of constant color on object surfaces used to align local correlation windows with object boundaries has improved the accuracy of recent window based stereo algorithms significantly. While several algorithms have been presented that work with adaptive correlation windows defined by color similarity, only a few ...

متن کامل

Matching topographic structures in stereo vision

Stereo vision is important m determining three-dimensional positions of tile visible surfaces in images. Most existing stereo matching methods involve matching low-level image features such as edges. A stereo matching technique based on matching high-level image features is described in this paper. The high-level image features extracted are topographic structures, arc segments and region segme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007